Small Stri tly Convex Quadrilateral Meshes of Point Sets

Upper and Lower Bounds for Stri tly Convex Quadrilateral Meshes of Point Sets

Constrained quadrilateral meshes of bounded size

We introduce a new algorithm to convert triangular meshes of polygonal regions, with or without holes, into strictly convex quadrilateral meshes of small bounded size. Our algorithm includes all vertices of the triangular mesh in the quadrilateral mesh, but may add extra vertices (called Steiner points). We show that if the input triangular mesh has t triangles, our algorithm produces a mesh wi...

Dynamical Aspects of Information Storage in Quantum - Mechanical Systems

Dynami al Aspe ts of Information Storage in Quantum-Me hani al Systems Maxim Raginsky We study information storage in noisy quantum registers and omputers using the methods of statisti al dynami s. We develop the on ept of a stri tly ontra tive quantum hannel in order to onstru t mathemati al models of physi ally realizable, i.e., nonideal, quantum registers and omputers. Stri tly ontra tive ha...

Local Versus Global Triangulations

Free form surfaces are commonly represented by triangular or quadrilateral meshes. Often these meshes are obtained from unorganized point sets sampled from some object’s surface. We show that local rather than global triangulations of point sets are equally well suited for object representations and that the local triangulations proposed in this paper may even lead to fast triangulation routines.

A New Algorithm for Generating Quadrilateral Meshes and its Application to FE-Based Image Registration

The use of finite element (FE) analysis in the simulation of physical phenomena over the human body has necessitated the construction of meshes from images. Despite the availability of several tools for generating meshes for FE-based applications, most cannot deal directly with the raw pixel-wise representation of image data. Additionally, some are optimized for the construction of much simpler...